An Analytic Construction of the Visual Secret Sharing Scheme for Color Images∗
نویسندگان
چکیده
This paper proposes a new construction of the visual secret sharing scheme for the (n, n)-threshold access structure applicable to color images. The construction uses matrices with n rows that can be identified with homogeneous polynomials of degree n. It is shown that, if we find a set of homogeneous polynomials of degree n satisfying a certain system of simultaneous partial differential equations, we can construct a visual secret sharing scheme for the (n, n)-threshold access structure by using the matrices corresponding to the homogeneous polynomials. The construction is easily extended to the cases of the (t, n)-threshold access structure and more general access structures. key words: secret sharing, visual secret sharing, visual cryptol-
منابع مشابه
Number theory based { k , n } Visual Cryptography Scheme For Color Images
An efficient and secure visual secret sharing scheme suitable for transmission of color images is introduced and discussed in this paper. The scheme employs number theory concepts and the pixel level representation of the color image to derive reciprocal encryption and decryption procedures. Using the input color image, the scheme generates n shares which are then distributed to participants. A...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملAn Implementation of a Novel Secret Image Sharing Algorithm
Visual Cryptography is a new cryptographic technique which allows visual information (pictures, text, etc.) to be encrypted in such a way that the decryption can be performed by human, without any decryption algorithm. This paper presents the study of the fundamental scheme of Visual Cryptography technique and proposes a novel method for sharing of images taking into account the untouched aspec...
متن کاملVisual Secret Sharing Schemes with Cyclic Access Structure for Many Images
We consider a visual secret sharing scheme with cyclic access structure for n secret images and n shares, where two consecutive shares decode one secret image. This secret sharing scheme can be constructed by using Droste’s method. However the contrast of its scheme is 1/(2n). In this paper, it is shown that for every integer n ≥ 4, there exists no construction of such a visual secret sharing s...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کامل